class Solution {
    public int minCostClimbingStairs(int[] cost) {
        //1.定义dp数组 
        int n = cost.length;
        int[] dp = new int[n + 1];
        //2.初始化dp数组
        dp[0] = 0;
        dp[1] = 0;
        for(int i = 2; i <= n; i++){
            dp[i] = Math.min(dp[i - 1] + cost[i - 1],dp[i - 2] + cost[i - 2]);
        }
        return dp[n];
    }
}